LINKED LISTS

• One of the 1st data structures that you'll be building.
  • It can contain a variable number of items
  • Since each item is referred to via a pointer, some operations would be faster than an array
  • Can remove elements easily
  • Cannot random access
  • Not contiguous
    • Contiguous is NOT the same as continuous. Contiguous means that the elements can be separated, continuous means that they cannot.
    • Because it's not contiguous, it won't be stored in the cache. (Slower!)
• Dynamic refers to run-time